Entropy estimates of small data sets
نویسندگان
چکیده
منابع مشابه
Entropy estimates of small data sets
Abstract. Estimating entropies from limited data series is known to be a non-trivial task. Näıve estimations are plagued with both systematic (bias) and statistical errors. Here, we present a new “balanced estimator” for entropy functionals (Shannon, Rényi and Tsallis) specially devised to provide a compromise between low bias and small statistical errors, for short data series. This new estima...
متن کاملCorrecting MM estimates for "fat" data sets
Regression MM estimates require the estimation of the error scale, and the determination of a constant that controls the e¢ ciency. These two steps are based on asymptotic results that are derived assuming that the number of predictors p remains xed while the number of observations n tends to in nity, which means assuming that the ratio p=n is small. However, many high-dimensional data sets ...
متن کاملFeature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach
Feature selection can significantly be decisive when analyzing high dimensional data, especially with a small number of samples. Feature extraction methods do not have decent performance in these conditions. With small sample sets and high dimensional data, exploring a large search space and learning from insufficient samples becomes extremely hard. As a result, neural networks and clustering a...
متن کاملCalculation of Data Reliability with Entropy for Fuzzy Sets
Measuring uncertainty for fuzzy sets has been carried out by calculating fuzzy entropy. Fuzzy entropy of fuzzy set is derived with the help of distance measure. The distance proportional value between the fuzzy set and the corresponding crisp set is designed as the fuzzy entropy. The usefulness is verified by proving the proposed entropy. Generally, fuzzy entropy contains the complementary char...
متن کاملAlgorithmic Entropy of Sets
In a previous paper a theory of program size formally identical to information theory was developed. The entropy of an individual finite object was defined to be the size in bits of the smallest program for calculating it. It was shown that this is − log2 of the probability that the object is obtained by means of a program whose successive bits are chosen by flipping an unbiased coin. Here a th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2008
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/20/202001